home *** CD-ROM | disk | FTP | other *** search
- Path: news3.near.net!yale!news-mail-gateway!daemon
- From: rbrito@ime.usp.br (Rogerio Brito)
- Newsgroups: comp.lang.c
- Subject: Re: fast find algorithm
- Date: 6 Apr 1996 19:47:32 -0500
- Organization: Math Institute, University of Sao Paulo, Brazil
- Sender: daemon@cs.yale.edu
- Message-ID: <PdvZxMlyZE9U088yn@ime.usp.br>
- References: <Dp8wE6.8DG@cix.compulink.co.uk>
- Reply-To: rbrito@ime.usp.br
- NNTP-Posting-Host: babyblue.cs.yale.edu
-
- huang@mnsinc.com (Szu-Wen Huang) wrote:
- >Falstaff (falstaff@xs4all.nl) wrote:
- >...
- >: Hashing is slightly slower than straight table lookup and can't be
- >: used when you want to delete elements from your table.
- >...
- >
- >Hashing can't be used when you want to delete elements? Please explain.
-
- I think he is refering to elimination of the item of some
- table. In such case, you should change your hash
- function. But if you don't have memory problems, you can
- simply ignore the location after it is "deleted". Or
- depending on the implementation, you can simply unlink it
- from your linked list (if it is the case, of course).
-
-
- []z, Roger...
-
- --
- ======================================================================
- Rogerio Brito - Computer Science Student - University of Sao Paulo
- e-mail: rbrito@ime.usp.br - home page: http://www.ime.usp.br/~rbrito
- "Windows? Linux and X!" - Member of Linux Users Group in Brazil
- ======================================================================
-